Online Multi-Coloring with Advice
نویسندگان
چکیده
We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of cellular networks, paths and hexagonal graphs. For the path, negative results trivially carry over to bipartite graphs, and our positive results are also valid for bipartite graphs. The advice given represents information that is likely to be available, studying for instance the data from earlier similar periods of time.
منابع مشابه
Advice Complexity of the Online Vertex Coloring Problem
We study online algorithms with advice for the problem of coloring graphs which come as input vertex by vertex. We consider the class of all 3-colorable graphs and its sub-classes of chordal and maximal outerplanar graphs, respectively. We show that, in the case of the first two classes, for coloring optimally, essentially log2 3 advice bits per vertex (bpv) are necessary and sufficient. In the...
متن کاملAdvice Complexity of Online Coloring for Paths
In online graph coloring a graph is revealed to an online algorithm one vertex at a time, and the algorithm must color the vertices as they appear. This paper starts to investigate the advice complexity of this problem – the amount of oracle information an online algorithm needs in order to make optimal choices. We also consider a more general problem – a trade-off between online and offline gr...
متن کاملRandomization Can Be as Helpful as a Glimpse of the Future in Online Computation
We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future. Intuitively, our direct product theorems say that if b bits of advice are needed to ensure a cost of at most t for some problem, then r · b bits of advice are needed to ensure a total cost of at most r · t when solving r independent in...
متن کاملOptimal Online Edge Coloring of Planar Graphs with Advice
We study the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally (i.e. using as few colors as possible). Assume that along with each edge, the online algorithm receives a fixed number of advice bits. For graphs of maximum degree ∆, it follows from Vizing’s Theorem that ⌈log(∆+ 1)⌉ bits per edge suffice to achieve optimality. We show that e...
متن کاملOnline Learning with Partial Feedback
In previous lectures we talked about the general framework of online convex optimization and derived an algorithm for prediction with expert advice from this general framework. To apply the online algorithm, we need to know the gradient of the loss function at the end of each round. In the prediction of expert advice setting, this boils down to knowing the cost of each individual expert. In thi...
متن کامل